A proof theoretic approach to qualitative probabilistic reasoning
نویسندگان
چکیده
منابع مشابه
Thesis Proposal Probabilistic Reasoning with Permutations: A Fourier-Theoretic Approach
Permutations are ubiquitous in many real-world problems, such as voting, ranking, and data association. Representing uncertainty over permutations is challenging, since there are n! possibilities, and common factorized probability distribution representations, such as graphical models, are inefficient due to the mutual exclusivity constraints that are typically associated with permutations. Thi...
متن کاملProof theoretic reasoning in System
This paper investigates how the rules of System P might be used in order to construct proofs for default rules which take into account the bounds on the probabilities of the consequents of the defaults. The paper deenes a proof system, shows that it is sound, and then discusses at length the completeness of the system, and the kind of proofs that it can generate.
متن کاملA Proof-Theoretic Approach to Tactics
Tactics and tacticals, programs that represent and execute several steps of deduction, are fundamental to theorem provers providing automated tools for creating proofs quickly and easily. The language used for tactics is usually a full-scale programming language, separate from the language used to represent proofs. Consequently, there is also a separation between the use of theorems in proofs a...
متن کاملA proof-theoretic approach to knowledge
We speculate on logical aspects of the so-called three wise men puzzle with proof-theoretic methods. We propose and study the following. (1) Logical ability of each player of a puzzle is equivalent to a logical system KL, which is based on classical propositional calculus augmented with inferences of knowledge operators. (2) Enriched pieces of knowledge of players are obtained as results of met...
متن کاملA Proof Theoretic Approach to Operational Semantics
Proof theory can be applied to the problem of specifying and reasoning about the operational semantics of process calculi. We overview some recent research in which λ-tree syntax is used to encode expressions containing bindings and sequent calculus is used to reason about operational semantics. There are various benefits of this proof theoretic approach for the π-calculus: the treatment of bin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 1998
ISSN: 0888-613X
DOI: 10.1016/s0888-613x(98)10011-7